منابع مشابه
1-Factorizations of random regular graphs
It is shown that for each r 3, a random r-regular graph on 2n vertices is equivalent in a certain sense to a set of r randomly chosen disjoint perfect matchings of the 2n vertices, as n ! 1. This equivalence of two sequences of probabilistic spaces, called contiguity, occurs when all events almost sure in one sequence of spaces are almost sure in the other, and vice versa. The corresponding sta...
متن کاملOne-Factorizations of Regular Graphs of Order 12
Algorithms for classifying one-factorizations of regular graphs are studied. The smallest open case is currently graphs of order 12; one-factorizations of r-regular graphs of order 12 are here classified for r ≤ 6 and r = 10, 11. Two different approaches are used for regular graphs of small degree; these proceed one-factor by one-factor and vertex by vertex, respectively. For degree r = 11, we ...
متن کاملRegular Factorizations of Contractions
Equivalent conditions are given for the regularity of a factorization of a contraction, two of which exhibit immediately the duality property of this notion. The concept of regular factorization of contractions of Hubert spaces1 was introduced in [1] by the authors in connection with their investigations on the invariant subspace problem; cf. [2, §VIL3]. Let A0 be a contraction of a Hubert spac...
متن کاملOrthogonal factorizations of graphs
Let G be a graph with vertex set V (G) and edge set E (G). Let k1, k2, . . . ,km be positive integers. It is proved in this study that every [0,k1þ þ km mþ 1]-graph G has a [0, ki]1 -factorization orthogonal to any given subgraph H with m edges. 2002 Wiley Periodicals, Inc. J Graph Theory 40: 267–276, 2002
متن کاملFactorizations of properties of graphs
A property of graphs is any isomorphism closed class of simple graphs. For given properties of graphs P1,P2, . . . ,Pn a vertex (P1,P2, . . . ,Pn)-partition of a graph G is a partition {V1, V2, . . . , Vn} of V (G) such that for each i = 1, 2, . . . , n the induced subgraph G[Vi] has property Pi. The class of all graphs having a vertex (P1,P2, . . . ,Pn)partition is denoted by P1◦P2◦ · · · ◦Pn....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1992
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90008-l